Differential Recursion and Differentially Algebraic Functions
نویسنده
چکیده
Moore introduced a class of real-valued “recursive” functions by analogy with Kleene’s formulation of the standard recursive functions. While his concise definition inspired a new line of research on analog computation, it contains some technical inaccuracies. Focusing on his “primitive recursive” functions, we pin down what is problematic and discuss possible attempts to remove the ambiguity regarding the behavior of the differential recursion operator on partial functions. It turns out that in any case the purported relation to differentially algebraic functions, and hence to Shannon’s model of analog computation, fails.
منابع مشابه
HYPERTRANSCENDENTAL FORMAL POWER SERIES OVER FIELDS OF POSITIVE CHARACTERISTIC
Let $K$ be a field of characteristic$p>0$, $K[[x]]$, the ring of formal power series over $ K$,$K((x))$, the quotient field of $ K[[x]]$, and $ K(x)$ the fieldof rational functions over $K$. We shall give somecharacterizations of an algebraic function $fin K((x))$ over $K$.Let $L$ be a field of characteristic zero. The power series $finL[[x]]$ is called differentially algebraic, if it satisfies...
متن کاملDifferentially 4-uniform bijections by permuting the inverse function
Block ciphers use Substitution boxes (S-boxes) to create confusion into the cryptosystems. Functions used as S-boxes should have low differential uniformity, high nonlinearity and algebraic degree larger than 3 (preferably strictly larger). They should be fastly computable; from this viewpoint, it is better when they are in even number of variables. In addition, the functions should be bijectio...
متن کاملNew Construction of Differentially 4-Uniform Bijections
Block ciphers use Substitution boxes (S-boxes) to create confusion into the cryptosystems. For resisting the known attacks on these cryptosystems, the following criteria for functions are mandatory: low differential uniformity, high nonlinearity and not low algebraic degree. Bijectivity is also necessary if the cipher is a Substitution-Permutation Network, and balancedness makes a Feistel ciphe...
متن کاملApplication of fractional-order Bernoulli functions for solving fractional Riccati differential equation
In this paper, a new numerical method for solving the fractional Riccati differential equation is presented. The fractional derivatives are described in the Caputo sense. The method is based upon fractional-order Bernoulli functions approximations. First, the fractional-order Bernoulli functions and their properties are presented. Then, an operational matrix of fractional order integration...
متن کاملEffective differential Nullstellensatz for ordinary DAE systems with constant coefficients
We give upper bounds for the differential Nullstellensatz in the case of ordinary systems of differential algebraic equations over the field of complex numbers. Let x be a set of n differential variables, f a finite family of differential polynomials in the ring C{x} and f ∈ C{x} another polynomial which vanishes at every solution of the differential equation system f = 0 in any differentially ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0704.0301 شماره
صفحات -
تاریخ انتشار 2007